On the Mesh Array for Matrix Multiplication
نویسنده
چکیده
This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1steps. The mesh array is examined for its application as a scrambling system.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملEfficiency of Matrix Multiplication on the Cross-Wired Mesh Array
This note looks at the efficiency of the cross-wired mesh array in the context of matrix multiplication. It is shown that in case of repeated operations, the average number of steps to multiply sets of n×n matrices on a mesh array of size n 2 approaches n.
متن کاملA two-layered mesh array for matrix multiplication
A two-layered mesh array for matrix multiplication is presented. It computes the matrix product faster than the standard array.
متن کاملA Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array
Matrix multiplication is a fundamental mathematical operation that has numerous applications across most scientific fields. Cannon’s distributed algorithm to multiply two n-by-n matrices on a two dimensional square mesh array with n cells takes exactly 3n−2 communication steps to complete. We show that it is possible to perform matrix multiplication in just 1.5n − 1 communication steps on a two...
متن کاملNew Results on Scrambling Using the Mesh Array
This paper presents new results on randomization using Kak’s Mesh Array for matrix multiplication. These results include the periods of the longest cycles when the array is used for scrambling and the autocorrelation function of the binary sequence obtained from the cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1010.5421 شماره
صفحات -
تاریخ انتشار 2010